Weighted Minimum Mean-Square Distance from Independence Estimation
نویسندگان
چکیده
منابع مشابه
Minimum mean square estimation and neural networks
Neural networks for estimation, such as the multilayer perceptron (MLP) and functional link net (FLN), are shown to approximate the minimum mean square estimator rather than the maximum likelihood estimator or others. Cramer-Rao maximum a posteriori lower bounds on estimation error can therefore be used to approximately bound network training error, when a statistical signal model is available ...
متن کاملAsymptotically Optimal Scalable Coding for Minimum Weighted Mean Square Error
In this paper, we derive an asymptotically optimal multi-layer coding scheme for entropy-coded scalar quantizers (SQ) that minimizes the weighted mean-squared error (WMSE). The optimal entropy-coded SQ is non-uniform in the case of WMSE. The conventional multi-layer coder quantizes the base-layer reconstruction error at the enhancement-layer, and is sub-optimal for the WMSE criterion. We consid...
متن کاملRate-distortion function via minimum mean square error estimation
We derive a simple general parametric representation of the rate–distortion function of a memoryless source, where both the rate and the distortion are given by integrals whose integrands include the minimum mean square error (MMSE) of the distortion ∆ = d(X, Y ) based on the source symbol X , with respect to a certain joint distribution of these two random variables. At first glance, these rel...
متن کاملUsing weighted power mean for equivalent square estimation
PURPOSE Equivalent Square (ES) enables the calculation of many radiation quantities for rectangular treatment fields, based only on measurements from square fields. While it is widely applied in radiotherapy, its accuracy, especially for extremely elongated fields, still leaves room for improvement. In this study, we introduce a novel explicit ES formula based on Weighted Power Mean (WPM) funct...
متن کاملOn weighted mean distance
In this paper we study the average distance in weighted graphs. More precisely, we consider assignments of families of non-negative weights to the edges. The aim is to maximise (minimise, respectively) the average distance in the resulting weighted graph. Two variants of the problem are considered depending on whether the collection of weights is fixed or not. The main results of this paper are...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Econometrica
سال: 2002
ISSN: 0012-9682,1468-0262
DOI: 10.1111/1468-0262.00362